Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Small-Angle Neutron Scattering at the Pulsed Reactor IBR-2: Current Status and Prospects

Crystallography Reports - Neutron diffraction studies on the small-angle neutron spectrometer YuMO (Joint Institute for Nuclear Research, Dubna), based on the IBR-2 pulsed reactor, have been...     

Mesomorphism of Dichotomous Compounds; X-Ray Diffraction Analysis of 4-Chlorophenyl Hexadecyl Ether

Crystallography Reports - The crystal and molecular structures of Cl–C6H4–O–C16H33 (I) have been studied, and its differential scanning calorimetry (DSC) study is performed....     

Multi-analyte HPLC–DAD Method for Concurrent Analysis of Six Antimicrobials and Three Proton Pump Inhibitors Frequently used in Management of Helicobacter pylori Infection: Application to Simulated Intestinal Fluid Samples

Chromatographia - The present work deals with the optimization, validation and application of a versatile HPLC–DAD method for concurrent estimation of nine antimicrobials and proton pump...     

Role of Conformational Changes of Hexameric Bacterial Uridine Phosphorylases in Substrate Binding

Crystallography Reports - Crystals of mutants of uridine phosphorylase from Shewanella oneidensis MR-1 at the active-site threonine residue were obtained, and the three-dimensional structures of...     

Neutron Scattering Techniques and Complementary Methods for Structural and Functional Studies of Biological Macromolecules and Large Macromolecular Complexes

Crystallography Reports - The review describes the application of small-angle scattering (SAS) of neutrons and complementary methods to study the structures of biomacromolecules. Here we cover SAS...     

Dark Energy with Phantom Crossing and the H0 Tension

We investigate the possibility of phantom crossing in the dark energy sector and the solution for the Hubble tension between early and late universe observations. We use robust combinations of different cosmological observations, namely the Cosmic Microwave Background (CMB), local measurement of Hubble constant (H0), Baryon Acoustic Oscillation (BAO) and SnIa for this purpose. For a combination of CMB+BAO data that is related to early universe physics, phantom crossing in the dark energy sector was confirmed at a 95% confidence level and we obtained the constraint H0=71.0−3.8+2.9 km/s/Mpc at a 68% confidence level, which is in perfect agreement with the local measurement by Riess et al. We show that constraints from different combinations of data are consistent with each other and all of them are consistent with phantom crossing in the dark energy sector. For the combination of all data considered, we obtained the constraint H0=70.25±0.78 km/s/Mpc at a 68% confidence level and the phantom crossing happening at the scale factor am=0.851−0.031+0.048 at a 68% confidence level.     

David Hull

Journal of Optimization Theory and Applications -     

Piecewise Monotonicity for Unary Functions in o-Stable Groups

Algebra and Logic - Unary functions definable in o-stable ordered groups of nonvaluational type are studied. Such functions are proved to be piecewise monotone and continuous.